Heuristic Placement Routines for Two-Dimensional Bin Packing Problem

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

An effective heuristic for the two-dimensional irregular bin packing problem

This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin packing problem. In the two-dimensional case, not only is it the case that the piece’s size is important but its shape also has a significant influence. Therefore, DJD as a selection heuristic has to be paired with a plac...

Two-Dimensional On-Line Bin Packing Problem with Rotatable Items

In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...

Two-Dimensional Bin Packing Problem with Guillotine Restrictions

A Hybrid Improvement Heuristic for the Bin Packing Problem

Given a set of n items with weights wi, i = 1, . . . , n, the bin packing (BP) problem consists of finding the minimum number of bins of capacity C necessary to pack the items, without violating the capacity constraint. This formulation also entails another problem (DBP), in which we seek to minimize the capacity of a fixed number m of identical bins, so that all items fit in the m bins without...